Non-regular iterators in process algebra

Non-regular iterators in process algebra

We consider three forms of non-regular iteration in process algebra: the push-down operation $, de5ned by xy = x((xy)(xy)) + y, the nesting operation ], de5ned by xy = x((xy)x) + y, and the back and forth operation , de5ned by x y= x((x y)y) + y. In the process algebraic framework ACP with abstraction and one of $, ] or we provide de5nitions of the following standard processes: stack, context-f...

Non Interleaving Process Algebra

Reduction and Topology, p. 28.

Non-regular Process Types

Process types specify sequences of acceptable messages. Even if the set of acceptable messages changes dynamically, a type checker can statically ensure that only acceptable messages are sent. As proposed so far, all message sequence sets speciied by types can be generated by regular grammars. We propose to increase the expressiveness so that non-regular message sequence sets can be speciied. T...

Process Algebra and Non-Interference

The information security community has long debated the exact definition of the term ‘security’. Even if we focus on the more specific notion of confidentiality the precise definition remains controversial. In their seminal paper [4], Goguen and Meseguer took an important step towards a formalisation of the notion of absence of information flow with the concept of non-interference. This too was...

Probabilistic Process Algebra Probabilistic Process Algebra